package algorithms.leecode;

import java.util.ArrayList;
import java.util.List;

public class Au135 {
    public static void main(String[] args) {
        System.err.println(new Au135().candy(new int[]{1,2,3,5,4,3,2,1,4,3,2,1,3,2,1,1,2,3,4,4,3,2,1}));
    }
    public int candy(int[] ratings) {

        List<Integer> list = new ArrayList<>();
        int count = 1;
        boolean add = true;
        int sum = 0;
        for (int i = 1; i < ratings.length; i++) {

        }

        return sum;

    }
}
